package com.iceberg;

public class SelectionSort {
    private int[] numbers;

    public int orderedIndex = -1;
    public int currentMinIndex = -1;
    public int currentCompareIndex = -1;

//   range from 1 to randomBound
    public SelectionSort(int N, int randomBound){
        numbers = new int[N];

        for (int i = 0; i < numbers.length; i ++){
            numbers[i] = (int)(Math.random()*randomBound) + 1;
        }
    }

    public int N(){
        return numbers.length;
    }

    public int get(int index){
        return numbers[index];
    }

    public void swap(int i, int j){
        int temp = numbers[i];
        numbers[i] = numbers[j];
        numbers[j] = temp;
    }
}
